On Some Eigenvector-Eigenvalue Relations
نویسندگان
چکیده
This paper generalizes the well-known identity which relates the last components of the eigenvectors of a symmetric matrix A to the eigenvalues of A and of the matrix An−1, obtained by deleting the last row and column of A. The generalizations relate to matrices and to Sturm–Liouville equations.
منابع مشابه
Pii: S0025-5564(02)00150-5
According to metapopulation theory, the capacity of a habitat patch network to support the persistence of a species is measured by the metapopulation capacity of the patch network. Mathematically, metapopulation capacity is given by the leading eigenvalue kM of an appropriately constructed non-negative n n matrix M, where n is the number of habitat patches. Both habitat destruction (in the sens...
متن کاملSome results on Haar wavelets matrix through linear algebra
Can we characterize the wavelets through linear transformation? the answer for this question is certainly YES. In this paper we have characterized the Haar wavelet matrix by their linear transformation and proved some theorems on properties of Haar wavelet matrix such as Trace, eigenvalue and eigenvector and diagonalization of a matrix.
متن کاملOn Eigenvector Bounds
There are methods to compute error bounds for a multiple eigenvalue together with an inclusion of a basis of the corresponding invariant subspace. Those methods have no restriction with respect to the structure of Jordan blocks, but they do not provide an inclusion of a single eigenvector. In this note we first show under general assumptions that a narrow inclusion of a single eigenvector is no...
متن کاملEla Using Least-squares to Find an Approximate Eigenvector∗
The least-squares method can be used to approximate an eigenvector for a matrix when only an approximation is known for the corresponding eigenvalue. In this paper, this technique is analyzed and error estimates are established proving that if the error in the eigenvalue is sufficiently small, then the error in the approximate eigenvector produced by the least-squares method is also small. Also...
متن کاملEla Computation of Eigenvalue and Eigenvector Derivatives for a General Complex-valued Eigensystem∗
In many engineering applications, the physical quantities that have to be computed are obtained by solving a related eigenvalue problem. The matrix under consideration and thus its eigenvalues usually depend on some parameters. A natural question then is how sensitive the physical quantity is with respect to (some of) these parameters, i.e., how it behaves for small changes in the parameters. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 20 شماره
صفحات -
تاریخ انتشار 1999